The Antnet Routing Algorithm - A Modified Version

نویسندگان

  • F. Tekiner
  • F. Z. Ghassemlooy
چکیده

Antnet is an agent based routing algorithm that is influenced from the unsophisticated and individual ant’s emergent behaviour. Ants (software agents) are used in antnet to collect information and to update the probabilistic distance vector routing table entries. Modified antnet algorithm has been introduced, which improve the throughput and average delay. Results shows that by detecting and dropping 0.5% of packets routed through the non-optimal routes the average delay per packet decreased and network throughput can be increased. The effect of the traffic fluctuations has been limited with the boundaries introduced in this paper and the number of ants in the network has been limited with the current throughput of the network at any given time.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TWO ANT COLONY ALGORITHMS FOR BEST-EFFORT ROUTING IN DATAGRAM NETWORKS GIANNI DI CARO and MARCO DORIGO

In this paper we present two versions of AntNet, a novel approach to adaptive learning of routing tables in wide area best-effort datagram networks. AntNet is a distributed multi-agent system inspired by the stigmergy model of communication observed in ant colonies. We report simulation results for AntNet on realistically sized networks using as performance measures throughput, packet delays an...

متن کامل

System on a Chip Implementation of Social Insect Behavior for Adaptive Network Routing

In this paper, a new efficient hardware architecture and its implementation for an AntNet-based routing are proposed. This architecture is based on the modified AntNet algorithm, and optimized to the ant packets defined in this paper. The modified AntNet is evaluated by the performance comparisons with the original AntNet algorithm through C-level simulations, and then implemented into RTL desi...

متن کامل

Two Ant Colony Algorithms for Best-effort Routing in Datagram Networks

In this paper we present two versions of AntNet, a novel approach to adaptive learning of routing tables in wide area best-effort datagram networks. AntNet is a distributed multi-agent system inspired by the stigmergy model of communication observed in ant colonies. We report simulation results for AntNet on realistically sized networks using as performance measures throughput, packet delays an...

متن کامل

Antnet: Modified Routing Algorithm for Packet Switched Networks

Antnet is an agent based routing algorithm based on real ants' behavior. Ants are able to find shortest path to food source .In real life, ants drop some kind of chemical substances to mark the path that they used. Then on their way back they choose the path with the highest pheromones which becomes the shortest path. But Antnet Algorithms may cause the network congestion and stagnation. Here, ...

متن کامل

Antnet Routing Algorithm with Link Evaporation and Multiple Ant Colonies to Overcome Stagnation Problem

Antnet is a software agent-based routing algorithm that is influenced by the unsophisticated and individual ant’s emergent behaviour. The aim of this chapter is twofold, firstly to introduce improvements to the antnet routing algorithm and then to critically review the work that is done around antnet and reinforcement learning in routing applications. In this chapter a modified antnet algorithm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004